Heat Kernels of Metric Trees and Applications
نویسندگان
چکیده
We consider the heat semigroup generated by the Laplace operator on metric trees. Among our results we show how the behavior of the associated heat kernel depends on the geometry of the tree. As applications we establish new eigenvalue estimates for Schrödinger operators on metric trees.
منابع مشابه
On two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملیادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملCoverings, heat kernels and spanning trees
We consider a graph G and a covering G̃ of G and we study the relations of their eigenvalues and heat kernels. We evaluate the heat kernel for an infinite k-regular tree and we examine the heat kernels for general k-regular graphs. In particular, we show that a k-regular graph on n vertices has at most (1 + o(1)) 2 log n kn log k ( (k − 1)k−1 (k2 − 2k)k/2−1 )n spanning trees, which is best possi...
متن کاملHeat Kernels on Metric Graphs and a Trace Formula
We study heat semigroups generated by self-adjoint Laplace operators on metric graphs characterized by the property that the local scattering matrices associated with each vertex of the graph are independent from the spectral parameter. For such operators we prove a representation for the heat kernel as a sum over all walks with given initial and terminal edges. Using this representation a trac...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Math. Analysis
دوره 45 شماره
صفحات -
تاریخ انتشار 2013